int QueueLen(SqQueue Q){
	return (Q->rear-Q->front);
}
int EnQueue(SqQueue &Q, Person e){
	if(Q->front==MAXQSIZE) return false;
	Q->rear++;
	Q->data[Q->rear]=e;
	return true;
}
int QueueEmpty(SqQueue &Q){
	return (Q->front==Q->rear);
}
int DeQueue(SqQueue &Q, Person &e){
	if(Q->front==Q->rear) return false;
	Q->front++;
	e=Q->data[Q->front];
	return true;
}
void DancePartner(Person dancer[], int num){
	int i=0,j;
	Person e;
	for(i=0;i<num;i++){
		if(dancer[i].sex=='F') EnQueue(Fdancers,dancer[i]);
		else EnQueue(Mdancers,dancer[i]);
	}
	while(Fdancers->front!=Fdancers->rear&&Mdancers->front!=Mdancers->rear){
		DeQueue(Fdancers,e);
		cout<<e.name<<" "<<" ";
		DeQueue(Mdancers,e);
		cout<<e.name<<endl;
	}
}
